The local Hamiltonian problem on a line with eight states is QMA-complete

نویسندگان

  • Sean Hallgren
  • Daniel Nagaj
  • Sandeep Narayanaswami
چکیده

The Local Hamiltonian problem – estimating the ground state energy of a local Hamiltonian – is a natural problem in physics, and belongs to the complexity class QMA. QMA is the quantum analogue of NP. Languages in QMA have a quantum verifier: a polynomial-time quantum algorithm that takes (poly-sized) quantum states as witnesses. In quantum mechanics, the Hamiltonian of a system is the Hermitian operator corresponding to the energy of the system: its eigenvalues are the set of energies that a system can be measured to have. It also determines the time-evolution of the system and defines the interactions between its subsystems. The least eigenvalue (ground state energy) and the corresponding eigenvector (the ground state) are key to understanding the properties of a

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3-local Hamiltonian is QMA-complete

It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by showing that 3-local Hamiltonian is already QMA-complete.

متن کامل

The complexity of antiferromagnetic interactions and 2D lattices

Estimation of the minimum eigenvalue of a quantum Hamiltonian can be formalised as the Local Hamiltonian problem. We study the natural special case of the Local Hamiltonian problem where the same 2-local interaction, with differing weights, is applied across each pair of qubits. First we consider antiferromagnetic/ferromagnetic interactions, where the weights of the terms in the Hamiltonian are...

متن کامل

Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices

We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is Quantum-MerlinArthur-complete (QMA-complete). We also show that finding the highest energy of a stoquastic Hamiltonian is QMA-complete and that adiabatic quantum computation using certain excited states of a stoquastic Hamiltonian is universal. We also show that adiabatic evolution in the ground state of a st...

متن کامل

The Complexity of the Local Hamiltonian Problem

The k-LOCAL HAMILTONIAN problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NPcomplete for k ≥ 2. It was known that the problem is QMA-complete for any k ≥ 3. On the other hand 1-LOCAL HAMILTONIAN is in P, and hence not believed to be QMA-complete. The complexity of the 2-LOCAL HAMILTONIAN problem has long ...

متن کامل

The Complexity of Quantum Systems on a One-dimensional Chain

We prove that adiabatic computation is equivalent to standard quantum computation even when the adiabatic quantum system is restricted to be a set of particles on a one-dimensional chain. We give a construction that uses a 2-local Hamiltonian on nearest neighbors using particles that can have ten distinct states. This implies a construction of a one-dimensional chain of qubits in which the Hami...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Quantum Information & Computation

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2013